Lift zonoid order and functional inequalities
نویسندگان
چکیده
منابع مشابه
Lift-and-Project Inequalities
The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the theoretical and on the practical point of view. On the theoretical side it allows you to construct the inequality description of the convex hull of all mixed-{0, 1} solutions of a binary MIP in n repeated applications of the technique, where n is...
متن کاملGeneralized additive functional inequalities in Banach algebras
Using the Hyers-Ulam-Rassias stability method, weinvestigate isomorphisms in Banach algebras and derivations onBanach algebras associated with the following generalized additivefunctional inequalitybegin{eqnarray}|af(x)+bf(y)+cf(z)| le |f(alpha x+ beta y+gamma z)| .end{eqnarray}Moreover, we prove the Hyers-Ulam-Rassias stability of homomorphismsin Banach algebras and of derivations on Banach ...
متن کاملIsoperimetry and functional inequalities
1.1 Brunn-Minkowski inequality 1.1 Theorem. (Brunn-Minkowski, ’88) If A and B are non-empty compact sets then for all λ ∈ [0, 1] we have vol ((1− λ)A+ λB) ≥ (1− λ)(volA) + λ(volB). (B-M) Note that if either A = ∅ orB = ∅, this inequality does not hold since (1−λ)A+λB = ∅. We can use the homogenity of volume to rewrite Brunn-Minkowski inequality in the form vol (A+B) ≥ (volA) + (volB). (1.1) We ...
متن کاملInequalities and Higher Order Convexity
We study the following problem: given n real arguments a1, ..., an and n real weights w1, ..., wn, under what conditions does the inequality w1f(a1) + w2f(a2) + · · ·+ wnf(an) ≥ 0 hold for all functions f satisfying f (k) ≥ 0 for some given integer k? Using simple combinatorial techniques, we can prove many generalizations of theorems ranging from the Fuchs inequality to the criterion for Schur...
متن کاملSecond-order cover inequalities
We introduce a new class of second-order cover inequalities whose members are generally stronger than the classical knapsack cover inequalities that are commonly used to enhance the performance of branch-and-cut methods for 0–1 integer programming problems. These inequalities result by focusing attention on a single knapsack constraint in addition to an inequality that bounds the sum of all var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Probability and Mathematical Statistics
سال: 2015
ISSN: 0094-9000,1547-7363
DOI: 10.1090/s0094-9000-2015-00937-6